#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
ll a[1100];

int main()
{
    IOS;
    ll n;
    cin>>n;
    for(ll i=0;i<n;i++){
        cin>>a[i];
    }    
    sort(a,a+n);
    bool flag=true;
    for(ll i=0;i<n-2;i++){
        for(ll j=i+1;j<n-1;j++){
            ll l=j+1,r=n-1,sum=a[i]+a[j];
            ll mid;
            while(l<=r){
                mid=(l+r)>>1;
                if(sum+a[mid]==0){
                    break;
                }
                if(sum+a[mid]>0)r=mid-1;
                else l=mid+1;
            }
            if(l<=r){
                flag=false;
                cout<<a[i]<<" "<<a[j]<<" "<<a[mid]<<endl;
            }
        }
    }
    if(flag){
        cout<<"No Solution"<<endl;
    }
    getchar();
    getchar();
    return 0;
}
